Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
نویسندگان
چکیده
In this paper, we consider the list decoding property of codes under insertion and deletion errors (insdel for short). Firstly, analyse decodability random insdel codes. Our result provides a more complete picture on when both happen. Secondly, construct family along with their efficient encoding algorithms through concatenation method which Zyablov-type bound metric
منابع مشابه
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion
We present two recursive techniques to construct compressed sensing schemes that can be “decoded" in sub-linear time. The first technique is based on the well studied code composition method called code concatenation where the “outer" code has strong list recoverability properties. This technique uses only one level of recursion and critically uses the power of list recovery. The second recursi...
متن کاملEfficiently Decodable Codes for the Binary Deletion Channel
In the random deletion channel, each bit is deleted independently with probability p. For the random deletion channel, the existence of codes of rate (1− p)/9, and thus bounded away from 0 for any p < 1, has been known. We give an explicit constructionwith polynomial time encoding and deletion correction algorithms with rate c0(1 − p) for an absolute constant c0 > 0.
متن کاملList-decodable zero-rate codes
We consider list-decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal τ ∈ [0, 1] for which there exists an arrangement ofM balls of relative Hamming radius τ in the binary hypercube (of arbitrary dimension) with the property that no point of the latter is covered by L or more of them. As M →∞ the maxim...
متن کاملExpander-Based Constructions of Efficiently Decodable Codes
We present several novel constructions of codes which share the common thread of using expander (or expander-like) graphs as a component. The expanders enable the design of efficient decoding algorithms that correct a large number of errors through various forms of “voting” procedures. We consider both the notions of unique and list decoding, and in all cases obtain asymptotically good codes wh...
متن کاملEfficiently Decodable Error-Correcting List Disjunct Matrices and Applications
A (d, `)-list disjunct matrix is a non-adaptive group testing primitive which, given a set of items with at most d “defectives,” outputs a superset of the defectives containing less than ` non-defective items. The primitive has found many applications as stand alone objects and as building blocks in the construction of other combinatorial objects. This paper studies error-tolerant list disjunct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3096154